问题描述:给出迷宫的大小n,m,输入迷宫的信息,1表示该点可走,0表示该点是死胡同,问你从起点到终点是否有路???
#include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int maxn=1000;
const int inf=100;
struct no
{
int x,y;
int value;
} node[maxn][maxn];
int n,m,ix,iy;
int beg_x,beg_y,end_x,end_y;
int direction[4][2]= {
{0,1},{0,-1},{1,0},{-1,0}};
int last[maxn],v,u;
vector<int> nodes;
queue<no> q;
int flag=1;
void bfs(int row,int col)
{
q.push(node[row][col]);
while(!q.empty())
{
no top = q.front();
u&#